Strongly NP-complete - PDFSEARCH.IO - Document Search Engine

Strongly NP-complete
Results: 18

#	Item
11	Approximation Algorithms for Orienting Mixed Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-25 15:14:20 NP-complete problems Graph Directed graph Strongly connected component Strong orientation Graph coloring Path decomposition Graph theory Mathematics Graph connectivity
12	Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems Add to Reading List Source URL: www.jair.org Language: English - Date: 2009-08-06 19:20:44 NP-complete problems Discrete geometry Operations research Combinatorial optimization Bin packing problem Generalized assignment problem Knapsack problem Packing problem Strongly NP-complete Theoretical computer science Computational complexity theory Mathematics
13	Pricing Network Edges to Cross a River Alexander Grigoriev1 , Stan van Hoesel1 , Anton F. van der Kraaij1 , Marc Uetz1 , and Mustapha Bouhtou2 1 Maastricht University, Quantitative Economics, P.O.Box 616, Add to Reading List Source URL: wwwhome.math.utwente.nl Language: English - Date: 2005-01-11 07:55:58 Complexity classes Operations research Network theory NP Shortest path problem Optimization problem Approximation algorithm Strongly NP-complete Flow network Theoretical computer science Computational complexity theory Applied mathematics
14	Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents Yoram Bachrach and Jeffrey S. Rosenschein {yori, jeff}@cs.huji.ac.il School of Engineering a Add to Reading List Source URL: www.ijcai.org Language: English - Date: 2005-07-11 16:49:14 Game theory Network flow Auctioneering Networks NP-complete problems Vertex cover Maximum flow problem Vickrey–Clarke–Groves auction Strategyproof Graph theory Mathematics Theoretical computer science
15	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
16	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
17	15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2005-10-28 08:20:42 Complexity classes Mathematical optimization Operations research NP-complete problems Strongly NP-complete Polynomial-time approximation scheme Job shop scheduling Knapsack problem Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
18	PDF Document Add to Reading List Source URL: ling.umd.edu Language: English - Date: 2009-08-01 00:43:08 Applied mathematics NP-complete Optimality theory NP-hard NP Hamiltonian path problem Complete Strongly NP-complete Co-NP Theoretical computer science Computational complexity theory Complexity classes